//]]>
Normal View MARC View ISBD View

Approximation Methods for Polynomial Optimization

by Li, Zhening.
Authors: He, Simai.%author. | Zhang, Shuzhong.%author. | SpringerLink (Online service) Series: SpringerBriefs in Optimization, 2190-8354 Physical details: VIII, 124 p. online resource. ISBN: 1461439841 Subject(s): Mathematics. | Algorithms. | Mathematical optimization. | Mathematics. | Optimization. | Mathematical Modeling and Industrial Mathematics. | Algorithms. | Applications of Mathematics.
Tags from this library:
No tags from this library for this title.
Item type Location Call Number Status Date Due
E-Book E-Book AUM Main Library 519.6 (Browse Shelf) Not for loan

1.  Introduction.-2. Polynomial over the Euclidean Ball -- 3. Extensions of the Constraint Sets -- 4. Applications -- 5. Concluding Remarks.

Polynomial optimization have been a hot research topic for the past few years and its applications range from Operations Research, biomedical engineering, investment science, to quantum mechanics, linear algebra, and signal processing, among many others. In this brief the authors discuss some important subclasses of polynomial optimization models arising from various applications, with a focus on approximations algorithms with guaranteed worst case performance analysis. The brief presents a clear view of the basic ideas underlying the design of such algorithms and the benefits are highlighted by illustrative examples showing the possible applications.   This timely treatise will appeal to researchers and graduate students in the fields of optimization, computational mathematics, Operations Research, industrial engineering, and computer science.

There are no comments for this item.

Log in to your account to post a comment.